Check out the towers of hanoi puzzle. (http://en.wikipedia.org/wiki/Tower_of_Hanoi.)

Prove carefully that to move \(N\) discs from one peg to another takes AT LEAST \(2^N-1\) moves, NO MATTER HOW YOU MOVE THE DISCS (so long as you never put any disc on top of a smaller disk).